NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
91	Steiner Tree Approximation via Iterative Randomized Rounding Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvo, Laura Sanita EPFL, Lausanne, Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Graph theory Computational complexity theory Mathematics Spanning tree NP-complete problems Approximation algorithms Steiner tree problem Complexity classes APX Combinatorial optimization Minimum spanning tree Cut
92	Cross-Number Puzzle Name _____________ Addition and Subtraction Date ______________ Add to Reading List Source URL: www.teachertools.org Language: English - Date: 2011-06-13 10:37:18 Mathematics Elementary arithmetic Subtraction Logic puzzles NP-complete problems Crossword Brain Age: Train Your Brain in Minutes a Day!
93	3. An Eventful 100 by Ucaoimhu (Solve only after solving Puzzles 1 and 2.) Add to Reading List Source URL: www.math.uchicago.edu Language: English - Date: 2016-07-02 11:10:23 NP-complete problems Leisure Puzzles Crosswords Gaming Mind Logic puzzles Acrostic Cryptic crossword
94	On the Tree Search Problem with Non-uniform Costs Ferdinando Cicalese∗ Bal´azs Keszegh† Bernard Lidick´ Add to Reading List Source URL: orion.math.iastate.edu Language: English - Date: 2014-08-22 14:44:58 Graph theory Mathematics Spanning tree Operations research NP-complete problems Dynamic programming Equations Systems engineering Vertex cover Minimum spanning tree
95	Bin Pa king via Dis repan y of Permutations F. Eisenbrand, D. Palv olgyi & T. Rothvo Cargese Workshop 2010 Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Computational complexity theory Theory of computation Complexity classes Strong NP-completeness Polynomial-time approximation scheme Bin Packing problems NP-complete problems Bin packing problem
96	Approximation Algorithms for the Class Cover Problem Adam Cannon and Lenore Cowen Department of Mathematical Sciences Johns Hopkins University Baltimore, MD 21218 Add to Reading List Source URL: www.cs.tufts.edu Language: English - Date: 2012-10-31 09:54:20 Computational complexity theory Mathematics Theory of computation NP-complete problems Operations research Set cover problem Approximation algorithm Facility location problem Dominating set Combinatorial optimization Reduction Algorithm
97	Petr Kolman Bernard Lidick´ y Jean-S´ebastien Sereni ON FAIR EDGE DELETION PROBLEMS ´ AND J.-S. SERENI P. KOLMAN, B. LIDICKY, Add to Reading List Source URL: kam.mff.cuni.cz Language: English - Date: 2009-09-29 04:25:56 Graph theory Graph coloring NP-complete problems Combinatorial optimization Matching Treewidth Graph Bipartite graph Planar graph Ear decomposition Degree Line graph
98	Noname manuscript No. (will be inserted by the editor) Subjective interestingness of subgraph patterns Matthijs van Leeuwen · Tijl De Bie · Eirini Spyropoulou · C´ Add to Reading List Source URL: www.patternsthatmatter.org Language: English - Date: 2016-01-15 06:48:18 Graph theory Mathematics Dense graph Graph Clique NP-complete problems Spanning tree
99	Graph Editing to a Given Degree Sequence? Petr A. Golovach1,2 and George B. Mertzios3 1 Department of Informatics, University of Bergen, Norway, . 2 Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2016-03-02 03:52:29 Graph theory Mathematics Graph coloring Degree Graph Eulerian path Ear decomposition NP-complete problems Graph operations Dominating set Incidence coloring

UPDATE